Sparse Non-negative Matrix Factorization and its Application in Overlapped Chromatograms Separation

نویسنده

  • Hong-Tao Gao
چکیده

A new NMF algorithm has been proposed for the deconvolution of overlapping chromatograms of chemical mixture. Most of the NMF algorithms used so far for chromatogram separation do not converge to a stable limit point. To get same results for all the runs, instead of random initialization, three different initialization methods have been used namely, ALS-NMF (robust initialization), NNDSVD based initialization and EFA based initializations. To improve the convergence, a new sNMF algorithm with modified multiplicative update (ML-sNMF) has been proposed in this work for overlapped chromatogram separation. The algorithm has been validated with the help of simulated partially, severely overlapped and embedded chromatograms. The proposed ML-sNMF algorithm has also been validated with the help of experimental overlapping chromatograms obtained using Gas Chromatography –Flame Ionization Detector (GCFID) for the chemical mixture of acetone and acrolein.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatograms separation using Matrix decomposition

Non – negative matrix factorization (NMF) was generally used to obtain representation of data using non – negativity constraints. It lead to parts – based (or) region based representation in the vector space because they allow only additive combinations of original data. NMF has been applied so far in image and text data analysis, audio signal separation, signal separation in bio-medical applic...

متن کامل

Non-Negative Matrix Factorization and Its Application in Blind Sparse Source Separation with Less Sensors Than Sources

Non-Negative Matrix Factorization (NMF) implies that a given nonnegative matrix is represented by a product of two non-negative matrices. In this paper, a factorization condition (consistent condition) on basis matrix is proposed firstly. For a given consistent basis matrix, although there exist infinite solutions (factorizations) generally, the sparse solution is unique with probability one, w...

متن کامل

Voice-based Age and Gender Recognition using Training Generative Sparse Model

Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...

متن کامل

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...

متن کامل

Speech Separation using Non-negative Features and Sparse Non-negative Matrix Factorization

This paper describes a method for separating two speakers in a single channel recording. The separation is performed in a low dimensional feature space optimized to represent speech. For each speaker, an overcomplete basis is estimated using sparse non-negative matrix factorization, and a mixture is separated by mapping the mixture onto the joint bases of the two speakers. The method is evaluat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013